Minimum status of trees with given parameters
نویسندگان
چکیده
The status of a vertex v in connected graph G is defined as the sum distances from to all other vertices . minimum We give smallest and largest values for tree with fixed parameters such diameter, number pendant vertices, odd degree two, characterize unique extremal trees.
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملMinimum order of graphs with given coloring parameters
A complete k-coloring of a graph G = (V,E) is an assignment φ : V → {1, . . . , k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number...
متن کاملTrees with Given Diameter and Minimum Second Geometric–Arithmetic Index∗
The second geometric-arithmetic index GA2(G) of a graph G was introduced recently by Fath-Tabar et al. [2] and is defined to be ∑ uv∈E(G) √ nu(e,G)nv(e,G) 1 2 [nu(e,G)+nv(e,G)] , where e = uv is one edge in G, and nu(e,G) denotes the number of vertices in G lying closer to u than to v. In this paper, we characterize the tree with the minimum GA2 index among the set of trees with given order and...
متن کاملIntegral trees with given nullity
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique.
متن کاملdiameter two graphs of minimum order with given degree set
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2020015